Cutting Plane Method for Continuously Constrained Kernel-Based RegressionZHE SUN; ZENGKE ZHANG; HUANGANG WANG et al.IEEE transactions on neural networks. 2010, Vol 21, Num 2, pp 238-247, issn 1045-9227, 10 p.Article

On global optimality conditions and cutting plane algorithmsTUY, H.Journal of optimization theory and applications. 2003, Vol 118, Num 1, pp 201-216, issn 0022-3239, 16 p.Article

Complexity results for the gap inequalities for the max-cut problemGALLI, Laura; KAPARIS, Konstantinos; LETCHFORD, Adam N et al.Operations research letters. 2012, Vol 40, Num 3, pp 149-152, issn 0167-6377, 4 p.Article

Separating tight metric inequalities by bilevel programmingMATTIA, Sara.Operations research letters. 2012, Vol 40, Num 6, pp 568-572, issn 0167-6377, 5 p.Article

Equivalence between intersection cuts and the corner polyhedronCONFORTI, Michele; CORNUEJOLS, Gérard; ZAMBELLI, Giacomo et al.Operations research letters. 2010, Vol 38, Num 3, pp 153-155, issn 0167-6377, 3 p.Article

Lower bounds for the Chvátal-Gomory rank in the 0/1 cubePOKUTTA, Sebastian; STAUFFER, Gautier.Operations research letters. 2011, Vol 39, Num 3, pp 200-203, issn 0167-6377, 4 p.Article

Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rankPOKUTTA, Sebastian; SCHULZ, Andreas S.Operations research letters. 2011, Vol 39, Num 6, pp 457-460, issn 0167-6377, 4 p.Article

Computational experience with general cutting planes for the Set Covering problemAVELLA, Pasquale; BOCCIA, Maurizio; VASILYEV, Igor et al.Operations research letters. 2009, Vol 37, Num 1, pp 16-20, issn 0167-6377, 5 p.Article

Multistars, partial multistars and the capacitated vehicle routing problemLETCHFORD, Adam N; EGLESE, Richard W; LYSGAARD, Jens et al.Mathematical programming. 2002, Vol 94, Num 1, pp 21-40, issn 0025-5610, 20 p.Article

Computing with multi-row Gomory cutsESPINOZA, Daniel G.Operations research letters. 2010, Vol 38, Num 2, pp 115-120, issn 0167-6377, 6 p.Article

A simple finite cutting plane algorithm for integer programsNETO, Jose.Operations research letters. 2012, Vol 40, Num 6, pp 578-580, issn 0167-6377, 3 p.Article

Lower bounds and heuristics for the Windy Rural Postman ProblemBENAVENT, Enrique; CARROTTA, Alessandro; CORBERAN, Angel et al.European journal of operational research. 2007, Vol 176, Num 2, pp 855-869, issn 0377-2217, 15 p.Article

Facet inequalities from simple disjunctions in cutting plane theorySEN, S; SHERALI, H. D.Mathematical programming. 1986, Vol 34, Num 1, pp 72-83, issn 0025-5610Article

On generating cutting planes from combinatorial disjunctionsSHERALI, H. D; SEN, S.Operations research. 1985, Vol 33, Num 4, pp 928-933, issn 0030-364XArticle

On the Chvátal rank of the Pigeonhole PrincipleRHODES, Mark.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2774-2778, issn 0304-3975, 5 p.Article

A surrogate cutting plane algorithm for all-integer programmingAUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 241-250, issn 0305-0548Article

On the convergence of cutting plane algorithms for a class of nonconvex mathematical programsSEN, S; SHERALI, S. D.Mathematical programming. 1985, Vol 31, Num 1, pp 42-56, issn 0025-5610Article

A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problemsCOLE, F; GOCHET, W; SMEERS, Y et al.Journal of optimization theory and applications. 1985, Vol 47, Num 2, pp 159-180, issn 0022-3239Article

An advanced start algorithm for all-integer programmingHANNA, M. E; AUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 301-309, issn 0305-0548Article

The Windy Clustered Prize-Collecting Arc-Routing ProblemCORBERAN, Angel; FERNANDEZ, Elena; FRANQUESA, Carles et al.Transportation science. 2011, Vol 45, Num 3, pp 317-334, issn 0041-1655, 18 p.Article

Cutting plane algorithms for 0-1 programming based on cardinality cutsOGUZ, Osman.European journal of operational research. 2010, Vol 205, Num 2, pp 273-279, issn 0377-2217, 7 p.Article

A constructive characterization of the split closure of a mixed integer linear programPABLO VIELMA, Juan.Operations research letters. 2007, Vol 35, Num 1, pp 29-35, issn 0167-6377, 7 p.Article

A sequential cutting plane algorithm for solving convex NLP problemsSTILL, Claus; WESTERLUND, Tapio.European journal of operational research. 2006, Vol 173, Num 2, pp 444-464, issn 0377-2217, 21 p.Article

The C³ theorem and a D² algorithm for large scale stochastic mixed-integer programming : Set convexificationSEN, Suvrajeet; HIGLE, Julia L.Mathematical programming. 2005, Vol 104, Num 1, pp 1-20, issn 0025-5610, 20 p.Article

Page / 23